MatchPlanner: A Self Tuning Tool for Planning Schema Matching Algorithms

نویسندگان

  • Fabien Duchateau
  • Remi Coletta
  • Zohra Bellahsene
چکیده

To improve the matching accuracy, most of the schema matching tools aggregate the results obtained by several matching algorithms. The quality of matches depends on the adequacy and of the number of match algorithms used, and their combination and aggregation strategy. However, this aggregation entails several drawbacks on the performance, quality and tuning aspects. In this paper, we present a novel method for combining schema matching algorithms, which enables to avoid these drawbacks. Unlike other composite matchers, it is able to learn the most appropriate match algorithms for a given schema matching scenario. Thus, the matching engine makes use of a decision tree to combine most appropriate match algorithms. As a first consequence of using the decision tree, the performance of the system is improved since the complexity is bounded by the height of the decision tree. For this purpose, for a given domain, only the most suitable match algorithms are used from a large library of match algorithms. The second advantage is the improvement of the quality of matches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Generic Approach for Schema Matcher Selection: Leveraging User Pre- and Post-match Effort for Improving Quality and Time Performance JURY

Towards a Generic Approach for Schema Matcher Selection: Leveraging User Preand Post-match Effort for Improving Quality and Time Performance Interoperability between applications or bridges between data sources are required to allow optimal information exchanges. Yet, some processes needed to bring this integration cannot be fully automatized due to their complexity. One of these processes is c...

متن کامل

Tuning Schema Matching Software using Synthetic Scenarios

Most recent schema matching systems assemble multiple components, each employing a particular matching technique. The domain user must then tune the system: select the right component to be executed and correctly adjust their numerous “knobs” (e.g., thresholds, formula coefficients). Tuning is skilland time-intensive, but (as we show) without it the matching accuracy is significantly inferior. ...

متن کامل

Application to Adaptive Control to Synchronous Machine Excitation

Self-tuning adaptive control technique has the advantage of being able to track the system operating conditions so that satisfactory control action can always be produced. Self-tuning algorithms can be implemented easily. Because the power systems are usually time varying non-linear systems and their parameters vary, adaptive controllers are very suitable for power systems. Characteristics of a...

متن کامل

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

QMatch - Using paths to match XML schemas

Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing popularity of the XML model and the proliferation of XML documents on-line, automated matching of XML documents and databases has become a critical issue. In this paper, we present a hybrid schema match algorithm, QMat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017